Depth-first search tree
A Depth-first search tree can be constructed by running depth-first search on a directed or undirected graph. The resulting tree can be used to discover bridges, articulation points, strongly connected components and other cycle-related properties of the original graph.